منابع مشابه
Ticket-based Multiple Packet Broadcasting in Delay Tolerant Networks
In delay tolerant networks (DTNs), broadcasting is an important routing function that supports the distribution of data to all users in the network. Efficient broadcasting in DTNs is a challenging problem due to the lack of continuous network connectivity. In this paper, we consider the limited bandwidth scenario for DTN broadcasting. Our scheme aims to provide a ticket-based multiple packet br...
متن کاملContact Duration-Aware Epidemic Broadcasting in Delay/Disruption-Tolerant Networks
DTNs (Delay/Disruption-Tolerant Networks) composed of mobile nodes in low node-density environments have attracted considerable attention in recent years. In this paper, we propose a CD-BCAST (Contact Duration BroadCAST) mechanism that can reduce the number of message forwardings while maintaining short message delivery delays in DTNs composed of mobile nodes. The key idea behind CD-BCAST is to...
متن کاملMobility-Aware Buffering for Delay-Tolerant Ad Hoc Broadcasting
Mobility plays a major role in mobile ad hoc networks (MANETs), since it stresses networking tasks such as routing on the one hand, but aids to increase the network capacity and to overcome network partitioning on the other hand. To benefit from node mobility, a new class of MANET protocols and applications are designed to be delay-tolerant and mobilityaided. The main communication paradigm her...
متن کاملFault-Tolerant Broadcasting in Radio Networks
We consider broadcasting in radio networks that are subject to permanent node failures of unknown location. Nodes are spread in a region in some regular way. We consider two cases: nodes are either situated at integer points of a line or they are situated on the plane, at grid points of a square or hexagonal mesh. Nodes send messages in synchronous time-slots. Each node v has a given transmissi...
متن کاملFault-Tolerant Broadcasting on the Arrangement Graph
This paper proposes a distributed fault-tolerant algorithm for one-to-all broadcasting in the oneport communication model on the arrangement graph. Exploiting the hierarchical properties of the arrangement graph to constitute different-sized broadcasting trees for different-sized subgraphs, we propose a distributed algorithm with optimal time complexity and without message redundancy for one-to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Broadcasting
سال: 2007
ISSN: 0018-9316
DOI: 10.1109/tbc.2006.889208